TSTP Solution File: NUM802^5 by Leo-III-SAT---1.7.10

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.10
% Problem  : NUM802^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n027.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May  7 10:45:47 EDT 2024

% Result   : Theorem 2.80s 1.73s
% Output   : Refutation 2.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   18 (   8 unt;   4 typ;   0 def)
%            Number of atoms       :   26 (   7 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  103 (  22   ~;   5   |;   4   &;  60   @)
%                                         (   0 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   10 (  10   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   5 con; 0-2 aty)
%            Number of variables   :   25 (   0   ^  19   !;   6   ?;  25   :)

% Comments : 
%------------------------------------------------------------------------------
thf(c_2_type,type,
    c_2: $i ).

thf(absval_type,type,
    absval: $i > $i ).

thf(c0_type,type,
    c0: $i ).

thf(c_less__type,type,
    c_less_: $i > $i > $o ).

thf(1,conjecture,
    ( ( c_less_ @ c_2 @ c0 )
   => ( ! [A: $i,B: $i] :
          ( ( c_less_ @ A @ c0 )
         => ( A
           != ( absval @ B ) ) )
     => ? [A: $i > $o] :
          ( ! [B: $i] :
              ~ ( A @ ( absval @ B ) )
          & ( A @ c_2 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBLEDSOE_FENG_8) ).

thf(2,negated_conjecture,
    ~ ( ( c_less_ @ c_2 @ c0 )
     => ( ! [A: $i,B: $i] :
            ( ( c_less_ @ A @ c0 )
           => ( A
             != ( absval @ B ) ) )
       => ? [A: $i > $o] :
            ( ! [B: $i] :
                ~ ( A @ ( absval @ B ) )
            & ( A @ c_2 ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ( ( c_less_ @ c_2 @ c0 )
     => ( ! [A: $i,B: $i] :
            ( ( c_less_ @ A @ c0 )
           => ( A
             != ( absval @ B ) ) )
       => ? [A: $i > $o] :
            ( ! [B: $i] :
                ~ ( A @ ( absval @ B ) )
            & ( A @ c_2 ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,plain,
    ~ ( ( c_less_ @ c_2 @ c0 )
     => ( ! [A: $i] :
            ( ( c_less_ @ A @ c0 )
           => ~ ? [B: $i] :
                  ( A
                  = ( absval @ B ) ) )
       => ? [A: $i > $o] :
            ( ~ ? [B: $i] : ( A @ ( absval @ B ) )
            & ( A @ c_2 ) ) ) ),
    inference(miniscope,[status(thm)],[3]) ).

thf(5,plain,
    ! [A: $i > $o] :
      ( ( A @ ( absval @ ( sk1 @ A ) ) )
      | ~ ( A @ c_2 ) ),
    inference(cnf,[status(esa)],[4]) ).

thf(8,plain,
    ! [A: $i > $o] :
      ( ( A @ ( absval @ ( sk1 @ A ) ) )
      | ~ ( A @ c_2 ) ),
    inference(simp,[status(thm)],[5]) ).

thf(6,plain,
    ! [B: $i,A: $i] :
      ( ~ ( c_less_ @ A @ c0 )
      | ( A
       != ( absval @ B ) ) ),
    inference(cnf,[status(esa)],[4]) ).

thf(9,plain,
    ! [B: $i,A: $i] :
      ( ( A
       != ( absval @ B ) )
      | ~ ( c_less_ @ A @ c0 ) ),
    inference(lifteq,[status(thm)],[6]) ).

thf(10,plain,
    ! [A: $i] :
      ~ ( c_less_ @ ( absval @ A ) @ c0 ),
    inference(simp,[status(thm)],[9]) ).

thf(16,plain,
    ! [B: $i,A: $i > $o] :
      ( ~ ( A @ c_2 )
      | ( ( A @ ( absval @ ( sk1 @ A ) ) )
       != ( c_less_ @ ( absval @ B ) @ c0 ) ) ),
    inference(paramod_ordered,[status(thm)],[8,10]) ).

thf(27,plain,
    ~ ( c_less_ @ c_2 @ c0 ),
    inference(pre_uni,[status(thm)],[16:[bind(A,$thf( ^ [C: $i] : ( c_less_ @ C @ c0 ) )),bind(B,$thf( sk1 @ ^ [C: $i] : ( c_less_ @ C @ c0 ) ))]]) ).

thf(7,plain,
    c_less_ @ c_2 @ c0,
    inference(cnf,[status(esa)],[4]) ).

thf(38,plain,
    ~ $true,
    inference(rewrite,[status(thm)],[27,7]) ).

thf(39,plain,
    $false,
    inference(simp,[status(thm)],[38]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : NUM802^5 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.15  % Command  : run_Leo-III %s %d
% 0.15/0.36  % Computer : n027.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Mon May  6 19:27:39 EDT 2024
% 0.15/0.36  % CPUTime  : 
% 0.99/0.91  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.23/1.04  % [INFO] 	 Parsing done (125ms). 
% 1.23/1.05  % [INFO] 	 Running in sequential loop mode. 
% 1.67/1.26  % [INFO] 	 nitpick registered as external prover. 
% 1.67/1.26  % [INFO] 	 Scanning for conjecture ... 
% 1.67/1.31  % [INFO] 	 Found a conjecture and 0 axioms. Running axiom selection ... 
% 1.91/1.33  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.91/1.33  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.91/1.34  % [INFO] 	 Type checking passed. 
% 1.91/1.34  % [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ... 
% 2.80/1.73  % [INFO] 	 Killing All external provers ... 
% 2.80/1.73  % Time passed: 1201ms (effective reasoning time: 674ms)
% 2.80/1.73  % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 2.80/1.73  % Axioms used in derivation (0): 
% 2.80/1.73  % No. of inferences in proof: 14
% 2.80/1.73  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1201 ms resp. 674 ms w/o parsing
% 2.80/1.77  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.80/1.77  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------